Straight line embeddings of rooted star forests in the plane

نویسندگان

  • Atsushi Kaneko
  • Mikio Kano
چکیده

For every 1 ≤ i ≤ n, let Ti be a rooted star with root vi, where vi is not necessary to be its center. Then the union F = T1 ∪T2 ∪ . . .∪ Tn is called a rooted star forest with roots v1, v2, . . . , vn. Let P be a set of |F | points in the plane in general position containing n specified points p1, p2, . . . , pn, where |F | denotes the order of F . Then we show that there exists a bijection φ : V (F ) → P such that φ(vi) = pi for all 1 ≤ i ≤ n, φ(x) and φ(y) are joined by a straight-line segment if and only if x and y are joined by an edge of F , and such that no two straight-line segments intersect except at their common end-point. Mailing address Mikio Kano Department of CIS Ibaraki University Hitachi 316 JAPAN e-mail: [email protected] fax: +81-294-37-1429

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semi-balanced Partitions of Two Sets of Points and Embeddings of Rooted Forests

Let m be a positive integer and let R1, R2 and B be three disjoint sets of points in the plane such that no three points of R1 ∪ R2 ∪ B lie on the same line and |B| = (m−1)|R1|+m|R2|. Put g = |R1∪R2|. Then there exists a subdivision X1∪X2∪· · ·∪Xg of the plane into g disjoint convex polygons such that (i) |Xi ∩ (R1 ∪ R2)| = 1 for all 1 ≤ i ≤ g; and (ii) |Xi ∩B| = m−1 if |Xi ∩R1| = 1, and |Xi ∩B...

متن کامل

Journal of Graph Algorithms and Applications Optimal Algorithms to Embed Trees in a Point Set

We present optimal (n log n) time algorithms to solve two tree embedding problems whose solution previously took quadratic time or more: rooted-tree embeddings and degree-constrained embeddings. In the rootedtree embedding problem we are given a rooted tree T with n nodes and a set of n points P with one designated point p and are asked to nd a straight-line embedding of T into P with the root ...

متن کامل

Optimal Algorithms to Embed Trees in a Point Set

We present optimal Θ(n log n) time algorithms to solve two tree embedding problems whose solution previously took quadratic time or more: rooted-tree embeddings and degree-constrained embeddings. In the rootedtree embedding problem we are given a rooted tree T with n nodes and a set of n points P with one designated point p and are asked to find a straight-line embedding of T into P with the ro...

متن کامل

Plane 3-trees: Embeddability & Approximation

We give anO(n log n)-time linear-space algorithm that, given a plane 3-tree G with n vertices and a set S of n points in the plane, determines whether G has a point-set embedding on S (i.e., a planar straight-line drawing of G where each vertex is mapped to a distinct point of S), improving the O(n)-time O(n)-space algorithm of Moosa and Rahman. Given an arbitrary plane graph G and a point set ...

متن کامل

Enumerating Rooted Biconnected Planar Graphs with Internally Triangulated Faces

A graph is called a triangulated planar graph if it admits a plane embedding in the plane such that all inner faces are triangle. In a rooted triangulated planar graph, a vertex and two edges incident to it are designated as an outer vertex and outer edges, respectively. Two plane embedding of rooted triangulated planar graphs are defined to be equivalent if they admit an isomorphism such that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 101  شماره 

صفحات  -

تاریخ انتشار 2000